FINITE FIELD MODELS IN ARITHMETIC COMBINATORICS – TEN YEARS ON J. WOLF Abstract. It has been close to ten years since the publication of Green’s influential survey Finite field models in additive combinatorics [28],

Source URL: www.juliawolf.org

UNH_CMAC Version 2.1 The University of New Hampshire Implementation of the Cerebellar Model Arithmetic Computer - CMAC August 31, 1994 (last modified July, 1996) W. Thomas Miller and Filson H. Glanz

Source URL: incompleteideas.net

• Computational neuroscience
• Neuroscience
• Nervous system
• Sensory systems
• Artificial neural networks
• Applied mathematics
• Receptive field
• Cerebellar model articulation controller
• One-key MAC
• Hash function
• Contrast
• Image segmentation

Problem introduction - security of ECC systems Activity variations in Hardware Arithmetic Operators Results and conclusions GF (2m ) Finite-Field Multipliers with Reduced Activity Variations

Source URL: www5.rz.rub.de

Density Computations for Real Quadratic Units Wieb Bosma; Peter Stevenhagen Mathematics of Computation, Vol. 65, NoJul., 1996), ppStable URL: http://links.jstor.org/sici?sici=%%2965%

Source URL: www.math.ru.nl

• Algebra
• Mathematics
• Abstract algebra
• Algebraic number theory
• Quadratic forms
• Field theory
• Modular arithmetic
• Quadratic field
• Prime number
• Discriminant
• Fundamental unit
• Factorization

Computing canonical heights using arithmetic intersection theory We show how the canonical height on the Jacobian of a smooth projective curve over a number field can be computed in practice using arithmetic intersection

Source URL: www.uni-regensburg.de

(UN)DECIDABLITY Undecidable: predicate calculus, Peano arithmetic (Church) Decidable: • Presburger arithmetic (Presburger) • Elementary theory of the ordered field R (Tarski)

Source URL: www.mathematik.uni-muenchen.de

ON THE BOUNDED COHOMOLOGY OF SEMI-SIMPLE GROUPS, S-ARITHMETIC GROUPS AND PRODUCTS NICOLAS MONOD Abstract. We prove vanishing results for Lie groups and algebraic groups (over any local field) in bounded cohomology. The m

Source URL: egg.epfl.ch

BRICS Basic Research in Computer Science BRICS RSCramer & Damg˚ard: Zero-Knowledge Proofs for Finite Field Arithmetic Zero-Knowledge Proofs for

Source URL: www.brics.dk

Batch binary Edwards D. J. Bernstein University of Illinois at Chicago NSF ITR– Nonnegative elements of Z:

Source URL: www.iacr.org

• Integer sequences
• Ring theory
• Public-key cryptography
• Field theory
• Finite field
• Prime number
• Factorial
• Ring
• Modular arithmetic
• Mathematics
• Abstract algebra
• Mathematical analysis

The 28th Nordic Mathematical Contest Monday, 31 March 2014 Problem set with solutions The time allowed is 4 hours. Each problem is worth 5 points. The only permitted aids are writing and drawing tools.

Source URL: www.georgmohr.dk

• Group theory
• Function
• Modular arithmetic
• Quasigroup
• Algebraic number field
• Mathematics
• Abstract algebra
• Algebraic number theory